Organic Chemical Compounds by Using Parser Combinators and the Generative Lexicon Theory
نویسندگان
چکیده
This work proposes OCLAS (Organic Chemistry Language Ambiguity Solver), an automatic system to analyze syntactically and semantically Organic Chemistry compound names and to generate the pictures of their chemical structures. If both parses detect that the input name corresponds to a theoretically possible organic chemical compound, the system generates its molecular structure picture, whether or not the name respects the current official nomenclature. This capacity of treating even names which, in spite of do not respect the constraints of the official nomenclatures, correspond to theoretically possible organic compound, represents an advance of OCLAS compared to other existing systems. OCLAS counts on the following tools: Generative Lexicon Theory (GLT), Parser Combinators and the Language Clean and an extension of the Xymtec package of Latex. The implemented system represents a helpful and friendly utilitarian as an automatic Organic Chemistry instructor.
منابع مشابه
تحلیل و نقد کتاب The Generative Lexicon
مقالة حاضر به معرفی و نقد کتاب واژگان زایشی اثر جیمز پاستیوسکی میپردازد. نظریة واژگان زایشی چهارچوبی را برای نمایش و بازنمود دانش زبانی پیش مینهد که بازنماییهای معنایی ـ واژگانی عرضهشده در آن درواقع بخشی از اطلاعات ذخیرهشده در واژگاناند. در این رویکرد، تلاش بر این است تا کاربرد خلاقانة زبان شرح داده شود و با درنظرگرفتن ساختار و سطوح بازنمودیِ چندگانه برای انواع مختلف اطلاعات واژگ...
متن کاملGenerative semantics for prepositions , prefixes , and compounds
This paper presents ideas for formally representing and working with prepositions as stand-alone constructs in connection with nouns and verbs, as prefixes, and as connecting constituents in compounds. As main starting points serve (a) Davis’ proto(typical) roles for linking subject and complements of verbs with semantic roles in HPSG, (b) Pustejovsky’s generative lexicon theory, and (c) Cyc’s ...
متن کاملGeneralizing a Strongly Lexicalized Parser using Unlabeled Data
Statistical parsers trained on labeled data suffer from sparsity, both grammatical and lexical. For parsers based on strongly lexicalized grammar formalisms (such as CCG, which has complex lexical categories but simple combinatory rules), the problem of sparsity can be isolated to the lexicon. In this paper, we show that semi-supervised Viterbi-EM can be used to extend the lexicon of a generati...
متن کاملIntegration of Data from a Syntactic Lexicon into Generative and Discriminative Probabilistic Parsers
This article evaluates the integration of data extracted from a syntactic lexicon, namely the Lexicon-Grammar, into several probabilistic parsers for French. We show that by modifying the Part-ofSpeech tags of verbs and verbal nouns of a treebank, we obtain accurate performances with a parser based on Probabilistic Context-Free Grammars (Petrov et al., 2006) and a discriminative parser based on...
متن کاملGeneralized Parser Combinators
Parser combinators are a well-known technique for constructing recursive-descent parsers through composition of other, less-complex parsers. In fact, parser combinators are often held up as an example of the elegance and composability inherent to functional programming. However, like any application of recursive-descent, parser combinators fail to support grammars with left-recursion or most ki...
متن کامل